#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
typedef pair<LL,LL>P;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL h[maxn],ans[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        LL n,m,x;cin>>n>>m>>x;
        for(int i=1;i<=n;i++) ans[i]=0;
        for(int i=1;i<=n;i++) cin>>h[i];
        priority_queue<P,vector<P>,greater<P> >que;
        for(int i=1;i<=m;i++){
            que.push({0,i});
        }
        for(int i=1;i<=n;i++){
            P x=que.top();que.pop();
            x.first+=h[i];
            ans[i]=x.second;
            que.push(x);
        }
        LL maxm =INT_MIN;LL minm=INT_MAX;
        while(!que.empty()){
            maxm=max(maxm,que.top().first);
            minm=min(minm,que.top().first);
            que.pop();
        }
        if(maxm-minm<=x){
            cout<<"YES"<<endl;
            for(int i=1;i<=n;i++){
                cout<<ans[i]<<" ";
            }cout<<endl;
        }
        else cout<<"NO"<<endl;
    }
   	return 0;
}
